Lambda terms definable as combinators
نویسندگان
چکیده
منابع مشابه
Lambda Terms Definable as Combinators
It is well known that for each l-term there is a corresponding combinatory term formed using the combinators K and S instead of the I-operator. Similarly for every combinatory term there is a i.-term. For weaker sets of combinators such as B, C and K or B, B’, I and W we show how such a correspondence or “translation” can be formulated and we determine in the case of several such sets of combin...
متن کاملLambda-calculus, Combinators and the Comprehension Scheme Lambda-calculus, Combinators and the Comprehension Scheme
The presentations of type theory based on a comprehension scheme and on -calculus are equivalent, both in the sense that the latter is a conservative extension of the former and that it can be encoded into it preserving provability. A similar result holds for set theory. A short version of this paper appeared in the proceedings of the conference Typed Lambda-calculi and Applications (1995). Key...
متن کاملA Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations
With sound unification, Definite Clause Grammars and compact expression of combinatorial generation algorithms, logic programming is shown to conveniently host a declarative playground where interesting properties and behaviors emerge from the interaction of heterogenous but deeply connected computational objects. Compact combinatorial generation algorithms are given for several families of lam...
متن کاملIntroduction to Combinators and Lambda-Calculus
As known, to finish this book, you may not need to get it at once in a day. Doing the activities along the day may make you feel so bored. If you try to force reading, you may prefer to do other entertaining activities. But, one of concepts we want you to have this book is that it will not make you feel bored. Feeling bored when reading will be only unless you don't like the book. introduction ...
متن کاملA Characterisation of Lambda Definable Tree Operations
I-language over simple type structure is considered. Type Y== (0 --t (0 -+ 0)) + (0 -+ 0) is called a binary tree type because of the isomorphism between binary trees and closed terms of this type. Therefore any closed term of type Y+(Y-P ... -P (Y + Y) ) represents an n-ary tree function. The problem is to characterize tree operations represented by the closed terms of the examined type. It is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00111-9